$MAP1, MAP2/G/1 FINITE QUEUES WITH SERVICE SCHEDULING FUNCTION DEPENDENT UPON QUEUE LENGTHS
نویسندگان
چکیده
منابع مشابه
Finite-Buffer Queues with Workload-Dependent Service and Arrival Rates
We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer impatience and queues regulated by the complete rejection discipline. Our study is motivated by que...
متن کاملThe Effect of Service Time Variability on Maximum Queue Lengths in $M^{X}/G/1$ Queues
We study the impact of service time distributions on the distribution ofthe maximum queue length during a busy period for the Mx/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite-buffer (M/G/1/n) systems. We show the somewhat surprising result that, for three variations of the preemptive last-come-first-served discipline,...
متن کاملThe effect of service time variability on maximum queue lengths in M/G/1 queues
We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite buffer (M/G/1/n) systems. We show the somewhat surprising result that for three variations of the preemptive LCFS discipline, the maximum queue ...
متن کاملI-Queue: Smart Queues for Service Management
Modern enterprise applications and systems are characterized by complex underlying software structures, constantly evolving feature sets, and frequent changes in the data on which they operate. The dynamic nature of these applications and systems poses substantial challenges to their use and management, suggesting the need for automated solutions. This paper considers a specific set of dynamic ...
متن کاملComputational analysis of (MAP1, MAP2)/(PH1, PH2)/N queues with finite buffer in wireless cellular networks
This paper studies a queueing model with the finite buffer of capacity K in wireless cellular networks, which has two types of arriving calls—handoff and originating calls, both of which follow the Markov arriving process with different rates. The channel holding times of the two types of calls follow different phase-type distributions. Firstly, the joint distribution of two queue lengths is de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2009
ISSN: 1015-8634
DOI: 10.4134/bkms.2009.46.4.673